Minimal Social Laws

نویسندگان

  • David Fitoussi
  • Moshe Tennenholtz
چکیده

Research on social laws in computational environments has proved the usefulness of the law-based approach for the coordination of multi-agent systems. Though researchers have noted that the imposition of a specification could be attained by a variety of different laws, there has been no attempt to identify a criterion for selection among alternative useful social laws. We propose such a criterion which is based on the notion of rainimality. A useful social law puts constraints on the agents’ actions in such a way that as a result of these constraints, they are able to achieve their goals. A minimal social law is a useful social law that minimizes the amount of constraints the agents shall obey. Minimal social laws give an agent maximal flexibility in choosing a new behavior as a function of various local changes either in his capabilities or in his objectives, without interfering with the other agents. We show that this concept can be usefully applied to a problem in robotics and present a computational study of minimal social laws.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Choosing social laws for multi-agent systems: Minimality and simplicity

The design of social laws for artiicial agent societies is a basic approach to coordinating multi-agent systems. It exposes the spectrum between fully-centralized and fully-decentralized coordination mechanisms. Useful social laws set constraints on the agents' activities which allow them to work individually in a mutually compatible manner. The design of useful social laws is a problem of cons...

متن کامل

On-line Relaxing and Oo-line Learning of Eeective Social Laws

Automation of planning techniques can potentially save a great deal of design and programming time, and can help robots design plans when human help is not available. Currently, the computational cost of machine planning algorithms prevents widespread use of these systems, and these costs are magniied in multiagent systems. The most expensive and time-consuming aspect of multiagent systems, com...

متن کامل

Modularity and Communication in Multiagent Planning

Automation of planning techniques can potentially save a great deal of design and programming time, and can help robots design plans when human help is not available. Currently, the computational cost of machine planning algorithms prevents wide-spread use of these systems, and these costs are magni ed in multiagent systems. The most expensive and time-consuming aspect of multiagent systems, co...

متن کامل

Framed temporal logic programming

A Projection Temporal Logic is discussed and some of its laws are given. After that, an executable temporal logic programming language, called Framed Tempura, is formalized. A minimal model-based approach for framing in temporal logic programming is presented. Since framing destroys monotonicity, canonical models – used to define the semantics of non-framed programs – are no longer appropriate....

متن کامل

On Stable Social Laws and Qualitative Equilibrium for Risk-Averse Agents

This paper introduces and investigates the notion of qualitative equilibria, or stable social laws, in the context of qualitative decision making. Previous work in qualitative decision theory has used the maximin decision criterion for modelling qualitative decision making. When several decision-makers share a common environment, a corresponding notion of equilibrium can be deened. This notion ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1998